Weak convergence on Douglas-Rachford method
نویسنده
چکیده
We prove that the sequences generate by the Douglas-Rachford method converge weakly to a solution of the inclusion problem 2000 Mathematics Subject Classification: 47H05, 49J52, 47N10.
منابع مشابه
A Cyclic Douglas-Rachford Iteration Scheme
In this paper we present two Douglas–Rachford inspired iteration schemes which can be applied directly to N-set convex feasibility problems in Hilbert space. Our main results are weak convergence of the methods to a point whose nearest point projections onto each of the N sets coincide. For affine subspaces, convergence is in norm. Initial results from numerical experiments, comparing our metho...
متن کاملThe Cyclic Douglas–rachford Method for Inconsistent Feasibility Problems
We analyse the behaviour of the newly introduced cyclic Douglas–Rachford algorithm for finding a point in the intersection of a finite number of closed convex sets. This work considers the case in which the target intersection set is possibly empty. 1. Preliminaries and Notation Throughout we assume H is a (real) Hilbert space with inner product 〈·, ·〉 and induced norm ‖ · ‖. We use → (resp. w....
متن کاملStochastic Forward Douglas-Rachford Splitting for Monotone Inclusions
We propose a stochastic Forward Douglas-Rachford Splitting framework for finding a zero point of the sum of three maximally monotone operators in real separable Hilbert space, where one of them is cocoercive. We first prove the weak almost sure convergence of the proposed method. We then characterize the rate of convergence in expectation in the case of strongly monotone operators. Finally, we ...
متن کاملRelaxed Proximal Point Algorithms Based on A−maximal Relaxed Monotonicity Frameworks with Applications
Based on the A−maximal (m)−relaxed monotonicity frameworks, the approximation solvability of a general class of variational inclusion problems using the relaxed proximal point algorithm is explored, while generalizing most of the investigations, especially of Xu (2002) on strong convergence of modified version of the relaxed proximal point algorithm, Eckstein and Bertsekas (1992) on weak conver...
متن کاملMetric Selection in Douglas-Rachford Splitting and ADMM
Recently, several convergence rate results for Douglas-Rachford splitting and the alternating direction method of multipliers (ADMM) have been presented in the literature. In this paper, we show linear convergence of Douglas-Rachford splitting and ADMM under certain assumptions. We also show that the provided bounds on the linear convergence rates generalize and/or improve on similar bounds in ...
متن کامل